0.11/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.63/0.71 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.70/0.91 % Computer : n027.cluster.edu 0.70/0.91 % Model : x86_64 x86_64 0.70/0.91 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.70/0.91 % Memory : 8042.1875MB 0.70/0.91 % OS : Linux 3.10.0-693.el7.x86_64 0.70/0.91 % CPULimit : 1200 0.70/0.91 % WCLimit : 120 0.70/0.91 % DateTime : Tue Jul 13 12:38:26 EDT 2021 0.70/0.91 % CPUTime : 0.70/0.91 % Number of cores: 8 0.70/0.91 % Python version: Python 3.6.8 0.70/0.91 # Version: 2.6rc1-ho 0.75/1.03 # SinE strategy is gf600_h_gu_R05_F100_L20000 0.75/1.03 # Trying AutoSched0 for 59 seconds 5.92/6.12 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S0Y 5.92/6.12 # and selection function SelectMaxLComplexAvoidPosPred. 5.92/6.12 # 5.92/6.12 # Preprocessing time : 0.630 s 5.92/6.12 # Presaturation interreduction done 5.92/6.12 5.92/6.12 # Proof found! 5.92/6.12 # SZS status Theorem 5.92/6.12 # SZS output start CNFRefutation 5.92/6.12 thf(conj_thm_2Eset__relation_2Erel__to__reln__inv, conjecture, ![X10:del, X19:del, X195:$i]:((ap @ (c_2Eset__relation_2Ereln__to__rel @ X10 @ X19) @ (ap @ (c_2Eset__relation_2Erel__to__reln @ X10 @ X19) @ X195))=(X195)<=mem @ X195 @ (arr @ X10 @ (arr @ X19 @ bool))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_thm_2Eset__relation_2Erel__to__reln__inv)). 5.92/6.12 thf(conj_thm_2Eset__relation_2Erel__to__reln__IS__UNCURRY, axiom, ![X10:del, X19:del]:(c_2Eset__relation_2Erel__to__reln @ X10 @ X19)=(c_2Epair_2EUNCURRY @ X10 @ X19 @ bool), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_thm_2Eset__relation_2Erel__to__reln__IS__UNCURRY)). 5.92/6.12 thf(conj_thm_2Eset__relation_2Ereln__to__rel__IS__CURRY, axiom, ![X10:del, X19:del]:(c_2Eset__relation_2Ereln__to__rel @ X10 @ X19)=(c_2Epair_2ECURRY @ X10 @ X19 @ bool), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_thm_2Eset__relation_2Ereln__to__rel__IS__CURRY)). 5.92/6.12 thf(conj_thm_2Epair_2ECURRY__UNCURRY__THM, axiom, ![X10:del, X19:del, X76:del, X45:$i]:(mem @ X45 @ (arr @ X10 @ (arr @ X19 @ X76))=>(ap @ (c_2Epair_2ECURRY @ X10 @ X19 @ X76) @ (ap @ (c_2Epair_2EUNCURRY @ X10 @ X19 @ X76) @ X45))=(X45)), file('/export/starexec/sandbox2/benchmark/Axioms/ITP001/ITP014^5.ax', conj_thm_2Epair_2ECURRY__UNCURRY__THM)). 5.92/6.12 thf(c_0_4, negated_conjecture, ~(![X10:del, X19:del, X195:$i]:(mem @ X195 @ (arr @ X10 @ (arr @ X19 @ bool))=>(ap @ (c_2Eset__relation_2Ereln__to__rel @ X10 @ X19) @ (ap @ (c_2Eset__relation_2Erel__to__reln @ X10 @ X19) @ X195))=(X195))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_thm_2Eset__relation_2Erel__to__reln__inv])])). 5.92/6.12 thf(c_0_5, negated_conjecture, (mem @ esk219_0 @ (arr @ esk217_0 @ (arr @ esk218_0 @ bool))&(ap @ (c_2Eset__relation_2Ereln__to__rel @ esk217_0 @ esk218_0) @ (ap @ (c_2Eset__relation_2Erel__to__reln @ esk217_0 @ esk218_0) @ esk219_0))!=(esk219_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])). 5.92/6.12 thf(c_0_6, plain, ![X10114:del, X10115:del]:(c_2Eset__relation_2Erel__to__reln @ X10114 @ X10115)=(c_2Epair_2EUNCURRY @ X10114 @ X10115 @ bool), inference(variable_rename,[status(thm)],[conj_thm_2Eset__relation_2Erel__to__reln__IS__UNCURRY])). 5.92/6.12 thf(c_0_7, plain, ![X10129:del, X10130:del]:(c_2Eset__relation_2Ereln__to__rel @ X10129 @ X10130)=(c_2Epair_2ECURRY @ X10129 @ X10130 @ bool), inference(variable_rename,[status(thm)],[conj_thm_2Eset__relation_2Ereln__to__rel__IS__CURRY])). 5.92/6.12 thf(c_0_8, negated_conjecture, (ap @ (c_2Eset__relation_2Ereln__to__rel @ esk217_0 @ esk218_0) @ (ap @ (c_2Eset__relation_2Erel__to__reln @ esk217_0 @ esk218_0) @ esk219_0))!=(esk219_0), inference(split_conjunct,[status(thm)],[c_0_5])). 5.92/6.12 thf(c_0_9, plain, ![X1:del, X2:del]:(c_2Eset__relation_2Erel__to__reln @ X1 @ X2)=(c_2Epair_2EUNCURRY @ X1 @ X2 @ bool), inference(split_conjunct,[status(thm)],[c_0_6])). 5.92/6.12 thf(c_0_10, plain, ![X1:del, X2:del]:(c_2Eset__relation_2Ereln__to__rel @ X1 @ X2)=(c_2Epair_2ECURRY @ X1 @ X2 @ bool), inference(split_conjunct,[status(thm)],[c_0_7])). 5.92/6.12 thf(c_0_11, plain, ![X11412:del, X11413:del, X11414:del, X11415:$i]:(~mem @ X11415 @ (arr @ X11412 @ (arr @ X11413 @ X11414))|(ap @ (c_2Epair_2ECURRY @ X11412 @ X11413 @ X11414) @ (ap @ (c_2Epair_2EUNCURRY @ X11412 @ X11413 @ X11414) @ X11415))=(X11415)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_thm_2Epair_2ECURRY__UNCURRY__THM])])). 5.92/6.12 thf(c_0_12, negated_conjecture, (ap @ (c_2Epair_2ECURRY @ esk217_0 @ esk218_0 @ bool) @ (ap @ (c_2Epair_2EUNCURRY @ esk217_0 @ esk218_0 @ bool) @ esk219_0))!=(esk219_0), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8, c_0_9]), c_0_10])). 5.92/6.12 thf(c_0_13, plain, ![X1:del, X2:del, X4:$i, X10:del]:((ap @ (c_2Epair_2ECURRY @ X1 @ X2 @ X10) @ (ap @ (c_2Epair_2EUNCURRY @ X1 @ X2 @ X10) @ X4))=(X4)|~mem @ X4 @ (arr @ X1 @ (arr @ X2 @ X10))), inference(split_conjunct,[status(thm)],[c_0_11])). 5.92/6.12 thf(c_0_14, negated_conjecture, mem @ esk219_0 @ (arr @ esk217_0 @ (arr @ esk218_0 @ bool)), inference(split_conjunct,[status(thm)],[c_0_5])). 5.92/6.12 thf(c_0_15, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14])]), ['proof']). 5.92/6.12 # SZS output end CNFRefutation 5.92/6.12 # Proof object total steps : 16 5.92/6.12 # Proof object clause steps : 7 5.92/6.12 # Proof object formula steps : 9 5.92/6.12 # Proof object conjectures : 7 5.92/6.12 # Proof object clause conjectures : 4 5.92/6.12 # Proof object formula conjectures : 3 5.92/6.12 # Proof object initial clauses used : 5 5.92/6.12 # Proof object initial formulas used : 4 5.92/6.12 # Proof object generating inferences : 1 5.92/6.12 # Proof object simplifying inferences : 4 5.92/6.12 # Training examples: 0 positive, 0 negative 5.92/6.12 # Parsed axioms : 3387 5.92/6.12 # Removed by relevancy pruning/SinE : 811 5.92/6.12 # Initial clauses : 6915 5.92/6.12 # Removed in clause preprocessing : 887 5.92/6.12 # Initial clauses in saturation : 6028 5.92/6.12 # Processed clauses : 8339 5.92/6.12 # ...of these trivial : 74 5.92/6.12 # ...subsumed : 415 5.92/6.12 # ...remaining for further processing : 7850 5.92/6.12 # Other redundant clauses eliminated : 11802 5.92/6.12 # Clauses deleted for lack of memory : 0 5.92/6.12 # Backward-subsumed : 4 5.92/6.12 # Backward-rewritten : 23 5.92/6.12 # Generated clauses : 97382 5.92/6.12 # ...of the previous two non-trivial : 85133 5.92/6.12 # Contextual simplify-reflections : 12 5.92/6.12 # Paramodulations : 72583 5.92/6.12 # Factorizations : 0 5.92/6.12 # NegExts : 0 5.92/6.12 # Equation resolutions : 11836 5.92/6.12 # Propositional unsat checks : 0 5.92/6.12 # Propositional check models : 0 5.92/6.12 # Propositional check unsatisfiable : 0 5.92/6.12 # Propositional clauses : 0 5.92/6.12 # Propositional clauses after purity: 0 5.92/6.12 # Propositional unsat core size : 0 5.92/6.12 # Propositional preprocessing time : 0.000 5.92/6.12 # Propositional encoding time : 0.000 5.92/6.12 # Propositional solver time : 0.000 5.92/6.12 # Success case prop preproc time : 0.000 5.92/6.12 # Success case prop encoding time : 0.000 5.92/6.12 # Success case prop solver time : 0.000 5.92/6.12 # Current number of processed clauses : 2006 5.92/6.12 # Positive orientable unit clauses : 744 5.92/6.12 # Positive unorientable unit clauses: 30 5.92/6.12 # Negative unit clauses : 34 5.92/6.12 # Non-unit-clauses : 1198 5.92/6.12 # Current number of unprocessed clauses: 88257 5.92/6.12 # ...number of literals in the above : 357307 5.92/6.12 # Current number of archived formulas : 0 5.92/6.12 # Current number of archived clauses : 5514 5.92/6.12 # Clause-clause subsumption calls (NU) : 5157811 5.92/6.12 # Rec. Clause-clause subsumption calls : 280078 5.92/6.12 # Non-unit clause-clause subsumptions : 408 5.92/6.12 # Unit Clause-clause subsumption calls : 13716 5.92/6.12 # Rewrite failures with RHS unbound : 4 5.92/6.12 # BW rewrite match attempts : 46409 5.92/6.12 # BW rewrite match successes : 193 5.92/6.12 # Condensation attempts : 0 5.92/6.12 # Condensation successes : 0 5.92/6.12 # Termbank termtop insertions : 2995360 5.92/6.13 5.92/6.13 # ------------------------------------------------- 5.92/6.13 # User time : 5.117 s 5.92/6.13 # System time : 0.105 s 5.92/6.13 # Total time : 5.222 s 5.92/6.13 # Maximum resident set size: 10424 pages 5.92/6.14 EOF